Monochromatic triangles in two-colored plane
نویسندگان
چکیده
We prove that for any partition of the plane into a closed set C and an open set O and for any configuration T of three points, there is a translated and rotated copy of T contained in C or in O. Apart from that, we consider partitions of the plane into two sets whose common boundary is a union of piecewise linear curves. We show that for any such partition and any configuration T which is a vertex set of a nonequilateral triangle there is a copy of T contained in the interior of one of the two partition classes. Furthermore, we give the characterization of these “polygonal” partitions that avoid copies of a given equilateral triple. These results support a conjecture of Erdős, Graham, Montgomery, Rothschild, Spencer and Straus, which states that every two-coloring of the plane contains a monochromatic copy of any nonequilateral triple of points; on the other hand, we disprove a stronger conjecture by the same authors, by providing non-trivial examples of two-colorings that avoid a given equilateral triple.
منابع مشابه
Monochromatic empty triangles in two-colored point sets
Improving a result of Aichholzer et. al., we show that there exists a constant c > 0 satisfying the following condition. Any two-colored set of n points in general position in the plane has at least cn triples of the same color such that the triangles spanned by them contain no element of the set in their interiors.
متن کاملEmpty Monochromatic Triangles
We consider a variation of a problem stated by Erdös and Guy in 1973 about the number of convex k-gons determined by any set S of n points in the plane. In our setting the points of S are colored and we say that a spanned polygon is monochromatic if all its points are colored with the same color. As a main result we show that any bi-colored set of n points in R in general position determines a ...
متن کاملTilings with trichromatic colored-edges triangles
This paper studies the tilings with colored-edges triangles constructed on a triangulation of a simply connected orientable surface such that the degree of each interior vertex is even (such as, for (fundamental) example, a part of the triangular lattice of the plane). The constraints are that we only use three colors, all the colors appear in each tile and two tile can share an edge only if th...
متن کاملMonochromatic cycles and monochromatic paths in arc-colored digraphs
We call the digraph D an m-colored digraph if the arcs of D are colored with m colors. A path (or a cycle) is called monochromatic if all of its arcs are colored alike. A cycle is called a quasi-monochromatic cycle if with at most one exception all of its arcs are colored alike. A subdigraph H in D is called rainbow if all its arcs have different colors. A set N ⊆ V (D) is said to be a kernel b...
متن کاملSane Bounds on Van der Waerden-Type Numbers
In Ramsey theory (a branch of combinatorics) one often proves that a function exists by giving enormous bounds on it. The function’s actual values may be much smaller; however, this is not known. In this paper we explore variants and special cases of these functions where we obtain much smaller bounds. The following is known: no matter how the lattice points of a coordinate plane are colored re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Combinatorica
دوره 29 شماره
صفحات -
تاریخ انتشار 2009